Causality, computing, and complexity

نویسنده

  • Russ Abbott
چکیده

I discuss two categories of causal relationships: primitive causal interactions of the sort characterized by Phil Dowe and the more general manipulable causal relationships as defined by James Woodward. All primitive causal interactions are manipulable causal relationships, but there are manipulable causal relationships that are not primitive causal interactions. I’ll call the latter constructed causal relationships, and I’ll argue that constructed causal relationships serve as a foundation for both computing and complex systems. Perhaps even more interesting are autonomous causal relationships. These are constructed causal relationships in which the causal mechanism resides primarily in the effect. A typical example is a software execution engine. Software execution engines are on the effect side of a cause-effect relationship in which software is the cause and the behavior of the execution engine is the effect. The mechanism responsible for that causal relationship resides in the execution engine. Introduction Causality has been a longstanding and controversial topic in philosophy. I think it’s fair to say, though, that Phil Dowe’s primitive causal interactions and James Woodward’s manipulable causality currently reign as the primary ways to think about philosophical causality. See the section below on actions and events for some additional background. Primitive causal interactions Primitive causal interactions correspond to direct interactions—the sorts of interactions one associates with billiard balls hitting one another. (Dowe 2000) defines a [primitive1] causal interaction as follows. An object is anything found in the ontology of science (such as particles, waves or fields), or common sense (such as chairs, buildings, or people). A world line is the collection of points on a space-time (Minkowski) diagram which represents the history of an object. A causal interaction is an intersection of world lines which involves [an] exchange of a conserved quantity. For our purposes one can think of a primitive causal interaction as occurring at a single moment in time and at a single point in space.2 Manipulable causal relationships A manipulable causal relationship is defined by Woodward (2003, 2012/forthcoming), as follows.3 1 Dowe uses the term causal interaction rather than primitive causal interaction. He entitles his book Physical Causality reflecting his commitment to fundamental physical interactions. Hence my use of the term primitive. 2 Quantum interactions do not occur at a single moment in time or at a single point in space. They occur through an exchange of virtual particles. Emission and absorption occur at different moments and different locations. But this issue will not be relevant for this paper, which will be concerned with macro-level interactions. 3 Woodward’s general definition is expressed in terms of probability distributions rather than just values.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Computational Complexity of Structure-Based Causality

Halpern and Pearl introduced a definition of actual causality; Eiter and Lukasiewicz showed that computing whether X = x is a cause of Y = y is NP-complete in binary models (where all variables can take on only two values) and Σ2 -complete in general models. In the final version of their paper, Halpern and Pearl slightly modified the definition of actual cause, in order to deal with problems po...

متن کامل

Paths to Unconventional Computing: Causality in Complexity

I describe my path to unconventionality in my exploration of theoretical and applied aspects of computation towards revealing the algorithmic and reprogrammable properties and capabilities of the world, in particular related to applications of algorithmic complexity in reshaping molecular biology and tackling the challenges of causality in

متن کامل

The Impact of the Economic Complexity Index on Competitiveness: A Study of Selected Emerging Countries

The main purpose of this study is to investigate the relationship between economic complexity and competitiveness using panel data in a sample of 39 emerging countries from 2002 to 2018. The results of the causality test of Dmitresco and Horlin Granger (2012) show a two-way cause between economic complexity and competitiveness. This indicates that the higher complexity of the economy helps coun...

متن کامل

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

متن کامل

New Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups

In this paper, a new  algorithm for computing secondary invariants of  invariant rings of monomial groups is presented. The main idea is to compute simultaneously a truncated SAGBI-G basis and the standard invariants of the ideal generated by the set of primary invariants.  The advantage of the presented algorithm lies in the fact that it is well-suited to complexity analysis and very easy to i...

متن کامل

A new algorithm for computing SAGBI bases up to an arbitrary degree

We present a new algorithm for computing a SAGBI basis up to an arbitrary degree for a subalgebra generated by a set of homogeneous polynomials. Our idea is based on linear algebra methods which cause a low level of complexity and computational cost. We then use it to solve the membership problem in subalgebras.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015